On the oracle complexity of smooth strongly convex minimization

We construct a family of functions suitable for establishing lower bounds on the oracle complexity first-order minimization smooth strongly-convex functions. Based this construction, we derive new under various inaccuracy criteria. The match known upper up to constant factor, and when solution is measured by its distance set, bound exactly matches obtained recent Information-Theoretic Exact Method same authors, thereby exact class problems.